Total orderings on a semilattice

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ordered Chaining for Total Orderings

We design new inference systems for total orderings by applying rewrite techniques to chaining calculi. Equality relations may either be specified axiomatically or built into the deductive calculus via paramodulation or superposition. We demonstrate that our inference systems are compatible with a concept of (global) redundancy for clauses and inferences that covers such widely used simplificat...

متن کامل

The canonical topology on a meet-semilattice

Considering the lattice of properties of a physical system, it has been argued elsewhere that – to build a calculus of propositions having a well-behaved notion of disjunction (and implication) – one should consider a very particular frame completion of this lattice. We show that the pertinent frame completion is obtained as sheafification of the presheaves on the given meet-semilattice with re...

متن کامل

Total orderings defined on the set of all fuzzy numbers

In this work, a new concept of upper dense sequence in interval (0,1] is introduced. There are infinitely many upper dense sequences in interval (0,1]. Using any upper dense sequence, a new decomposition theorem for fuzzy sets is established and proved. Then, using a chosen upper dense sequence as one of the necessary reference systems, infinitely many total orderings on the set of all fuzzy nu...

متن کامل

Semilattice Operations on Finite Subsets

In the article we deal with a binary operation that is associative, commutative. We define for such an operation a functor that depends on two more arguments: a finite set of indices and a function indexing elements of the domain of the operation and yields the result of applying the operation to all indexed elements. The definition has a restriction that requires that either the set of indices...

متن کامل

A Game on Partial Orderings

We study the determinacy of the game Gκ(A) introduced in [FuKoShe] for uncountable regular κ and several classes of partial orderings A. Among trees or Boolean algebras, we can always find an A such that Gκ(A) is undetermined. For the class of linear orders, the existence of such A depends on the size of κ. In particular we obtain a characterization of κ = κ in terms of determinacy of the game ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Japan Academy, Series A, Mathematical Sciences

سال: 1958

ISSN: 0386-2194

DOI: 10.3792/pja/1195524745